An optimal algorithm for plane matchings in multipartite geometric graphs
نویسندگان
چکیده
منابع مشابه
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
Let P be a set of n points in general position in the plane which is partitioned into color classes. P is said to be color-balanced if the number of points of each color is at most bn/2c. Given a color-balanced point set P , a balanced cut is a line which partitions P into two colorbalanced point sets, each of size at most 2n/3+1. A colored matching of P is a perfect matching in which every edg...
متن کاملMaximum Plane Trees in Multipartite Geometric Graphs
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = |R ∪ B|. A bichromatic plane spanning ...
متن کاملMatchings in Geometric Graphs
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study matching problems in...
متن کاملMaximum Matchings in Complete Multipartite Graphs
How many edges can there be in a maximum matching in a complete multipartite graph? Several cases where the answer is known are discussed, and then a new formula is given which answers this question.
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.02.004